Mechanising the Reals in an Interactive Theorem Prover Using Theory Interpretation Individual Abstracts and Compressed Postscript Les Are Available from Mechanising the Reals in an Interactive Theorem Prover Using Theory Interpretation
نویسندگان
چکیده
The mechanisation of the real numbers within theorem provers is of practical bene t for the veri cation of real-time systems. The real numbers provide a foundation within the theorem prover for classical mathematical analysis such as di erentiation and integration. The approach we have taken makes extensive use of theory interpretation to maximise theory reuse and hence minimise theorem redundancy. The theory developed is compared with Harrison's HOL version.
منابع مشابه
A Tool for Re ning Logic ProgramsRobert Colvin
Note: Most SVRC technical reports are available via anonymous ftp, from svrc.it.uq.edu.au in the directory /pub/techreports. Individual abstracts and compressed postscript les are available from Abstract The reenement calculus provides a method for transforming speciications to executable code, maintaining the correctness of the code with respect to its speciication. In the original reene-ment ...
متن کاملA Formal Approach to Speciication and Veriication of Task Management in Interactive Systems a Formal Approach to Speciication and Veriication of Task Management in Interactive Systems
Note: Most SVRC technical reports are available via anonymous ftp, from svrc.it.uq.edu.au in the directory /pub/techreports. Individual abstracts and compressed postscript les are available from Abstract This paper presents an approach to formal speciication of task management models for interactive systems. The approach is well suited to data-intensive applications in which the system is being...
متن کاملComputer-aided Development of a Real-time Program Computer-aided Development of a Real-time Program
Note: Most SVRC technical reports are available via anonymous ftp, from svrc.it.uq.edu.au in the directory /pub/techreports. Abstracts and compressed postscript les are available via Abstract The reenement calculus is a well-established theory for formal development of imperative program code and is supported by a number of automated tools. Via a detailed case study, this article shows how reen...
متن کاملMechanising Partiality without Re-implementation Mechanising Partiality without Re-implementation
Even though it is not very often admitted, partial functions do play a signii-cant role in many practical applications of deduction systems. Kleene has already given a semantic account of partial functions using a three-valued logic decades ago. This approach allows rejecting certain unwanted formulae as faulty, which the simpler two-valued ones accept. We have developed resolution and tableau ...
متن کاملMechanisation of PDA and Grammar Equivalence for Context-Free Languages
We provide a formalisation of the theory of pushdown automata (PDAs) using the HOL4 theorem prover. It illustrates how provers such as HOL can be used for mechanising complicated proofs, but also how intensive such a process can turn out to be. The proofs blow up in size in way difficult to predict from examining original textbook presentations. Even a meticulous text proof has “intuitive” leap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998